The Equivalence Problem over Finite Rings
نویسندگان
چکیده
We investigate the computational complexity of deciding whether or not a given polynomial , presented as the sum of monomials, is identically 0 over a ring. It is proved that if the factor by the Jacobson-radical is not commutative, then the problem is coNP-complete.
منابع مشابه
Triangularization over finite-dimensional division rings using the reduced trace
In this paper we study triangularization of collections of matrices whose entries come from a finite-dimensional division ring. First, we give a generalization of Guralnick's theorem to the case of finite-dimensional division rings and then we show that in this case the reduced trace function is a suitable alternative for trace function by presenting two triangularization results. The first one...
متن کاملThe Complexity of the Word-problem for Finite Matrix Rings
We analyze the so-called word-problem for M2(Z2), the ring of 2 × 2 matrices over Z2. We prove that the term-equivalence problem for the semigroup (and so for the ring) M2(Z2) is coNP-complete.
متن کاملOn Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given.
متن کاملThe extended equivalence and equation solvability problems for groups
The algorithmic aspects of the equivalence problem and the equation solvability problem have received increasing attention in the past two decades. The equivalence problem for a finite algebra A asks whether or not two (term or polynomial) expressions s and t are equivalent over A (denoted by A |= s ≈ t), i.e. if s and t determine the same function over A. The equation solvability is one of the...
متن کاملOn Black-Box Ring Extraction and Integer Factorization
The black-box extraction problem over rings has (at least) two important interpretations in cryptography: An efficient algorithm for this problem implies (i) the equivalence of computing discrete logarithms and solving the Diffie-Hellman problem and (ii) the in-existence of secure ring-homomorphic encryption schemes. In the special case of a finite field, Boneh/Lipton [BL96] and Maurer/Raub [MR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 21 شماره
صفحات -
تاریخ انتشار 2011